Degree Sequences of $F$-Free Graphs
نویسندگان
چکیده
منابع مشابه
Degree Sequences of F-Free Graphs
Let F be a fixed graph of chromatic number r + 1. We prove that for all large n the degree sequence of any F -free graph of order n is, in a sense, close to being dominated by the degree sequence of some r-partite graph. We present two different proofs: one goes via the Regularity Lemma and the other uses a more direct counting argument. Although the latter proof is longer, it gives better esti...
متن کاملThe degree sequences and spectra of scale-free random graphs
We investigate the degree sequences of scale-free random graphs. We obtain a formula for the limiting proportion of vertices with degree d, confirming non-rigorous arguments of Dorogovtsev et al [10]. We also consider a generalisation of the model with more randomisation, proving similar results. Finally, we use our results on the degree sequence to show that for certain values of parameters lo...
متن کاملDegree sequences of monocore graphs
A k-monocore graph is a graph which has its minimum degree and degeneracy both equal to k. Integer sequences that can be the degree sequence of some k-monocore graph are characterized as follows. A nonincreasing sequence of integers d1, . . . , dn is the degree sequence of some k-monocore graph G, 0 ≤ k ≤ n− 1, if and only if k ≤ di ≤ min {n− 1, k + n− i} and
متن کاملDiamond-free Degree Sequences
While attempting to classify partial linear spaces produced during the execution of an extension of Stinson’s hill-climbing algorithm a new problem arises, that of generating all graphical degree sequences that are diamond-free (i.e. have no diamond as subgraph) and satisfy additional constraints. We formalize this new problem, propose a constraint programming solution and list all satisfying d...
متن کاملDegree sequences of highly irregular graphs
We call a simple graph highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper we examine the degree sequences of highly irregular graphs. We give necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a highly irregular graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2005
ISSN: 1077-8926
DOI: 10.37236/1966